Hybrid Genetic and Spotted Hyena Optimizer for Flow Shop Scheduling Problem
نویسندگان
چکیده
This paper presents a new hybrid algorithm that combines genetic algorithms (GAs) and the optimizing spotted hyena (SHOA) to solve production shop scheduling problem. The proposed GA-SHOA incorporates operators, such as uniform crossover mutation, into SHOA improve its performance. We evaluated on set of OR library instances compared it other state-of-the-art optimization algorithms, including SSO, SCE-OBL, CLS-BFO ACGA. experimental results show consistently finds optimal or near-optimal solutions for all tested instances, outperforming algorithms. Our contributes field in several ways. First, we propose effectively exploration exploitation capabilities SHO GA, resulting balanced efficient search process finding FSSP. Second, tailor GA methods specific requirements FSSP, encoding schemes, objective function evaluation constraint handling, which ensures is well suited address challenges posed by Third, perform comprehensive performance algorithm, demonstrating effectiveness terms solution quality computational efficiency. Finally, provide an in-depth analysis behavior discussing roles components their interactions during process, can help understand factors contributing success insight potential improvements adaptations combinatorial problems.
منابع مشابه
A multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation
Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...
متن کاملA Hybrid Genetic Algorithm for the Flow-Shop Scheduling Problem
This paper presents a hybrid genetic algorithm for the Job Shop Scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities are defined by the genetic algorithm. Schedules are constructed using a procedure that generates parameterized active schedules. After a schedule is obtained a local s...
متن کاملMILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints
In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...
متن کاملThe hybrid flow shop scheduling problem
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many real world applications. Given its importance and complexity, the HFS problem has been intensively studied. This paper presents a literature review on exact, heuristic and metaheuristic methods that have been proposed f...
متن کاملAn Effective Hybrid Genetic Algorithm for Job Shop Scheduling Problem
The job shop scheduling problem (JSSP) is well known as one of the most difficult combinatorial optimization problems. This paper presents a hybrid genetic algorithm for the JSSP with the objective of minimizing makespan. The efficiency of the genetic algorithm is enhanced by integrating it with a local search method. The chromosome representation of the problem is based on operations. Schedule...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2023
ISSN: ['1999-4893']
DOI: https://doi.org/10.3390/a16060265